Hyperbolicity vs. Amenability for Planar Graphs
نویسندگان
چکیده
The aim of this paper is to clarify the relationship between Gromovhyperbolicity and amenability for planar maps.
منابع مشابه
Slim Unicorns and Uniform Hyperbolicity for Arc Graphs and Curve Graphs
We describe unicorn paths in the arc graph and show that they form 1–slim triangles and are invariant under taking subpaths. We deduce that all arc graphs are 7–hyperbolic. Considering the same paths in the arc and curve graph, this also shows that all curve graphs are 17–hyperbolic, including closed surfaces.
متن کاملObstructions to a small hyperbolicity in Helly graphs
It is known that for every graph G there exists the smallest Helly graph H(G) into which G isometrically embeds (H(G) is called the injective hull of G) such that the hyperbolicity of H(G) is equal to the hyperbolicity of G. Motivated by this, we investigate structural properties of Helly graphs that govern their hyperbolicity and identify three isometric subgraphs of the King-grid as structura...
متن کاملGromov Hyperbolicity in Mycielskian Graphs
Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph GM is hyperbolic and that δ(GM) is comparable to diam(GM). Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs;...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملOn the Hyperbolicity of Small-World and Tree-Like Random Graphs
Hyperbolicity is a property of a graph that may be viewed as being a “soft” version of a tree, and recent empirical and theoretical work has suggested that many graphs arising in Internet and related data applications have hyperbolic properties. Here, we consider Gromov’s notion of δ-hyperbolicity, and we establish several positive and negative results for small-world and tree-like random graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 58 شماره
صفحات -
تاریخ انتشار 2017